Computing multiple c-revision using OCF knowledge base

Belief revision is the process of revising epistemic states in the light of new information. In this paper epistemic states are represented in the framework of Spohn’s Ordinal Conditional Functions (OCF). The input is a consistent set of propositional formulas issued from different and independent sources. We focus on the so-called multiple iterated belief crevision recently proposed by Kern-Isberner. We propose a computation of c-revision when epistemic states are compactly represented by weighted propositional knowledge bases, called OCF knowledge bases.